The Value of ‘Even Distribution’ for Temporal Resource Partitions

Most Hierarchical Real-time Scheduling (HiRTS) techniques have focused on temporal resource partitions which time units are periodically distributed. Although such periodic partitions could provide great flexibility for resource partitioning, engineers are stuck when trying to determine the schedulability of real-time tasks running on them. The main reason is that periodic partitions fail to effectively bound the difference between the ideal and the actual resource allocation. To solve this problem, some researchers introduced the Regular Partition, a type of temporal resource partition which is almost evenly distributed. Recent research has shown that it achieves maximal transparency for task scheduling. Some classical real-time scheduling problems on a regular partition can be easily transformed into equivalent problems on a dedicated single resource. However, the resource partitioning problem for regular partitions is much more complicated than the one for periodic partitions. Based on a practical 2-layer HiRTS platform, this paper first introduces new resource partitioning techniques for regular partitions. After that, it compares the overall performance of the periodic partition and the regular partition. We conclude that the regular partition is a better choice for the integration of real-time applications. The Value of ‘Even Distribution’ for Temporal Resource Partitions Yu Li, Albert M. K. Cheng